cartesian product

cartesian product

美 　英

• un.笛卡尔乘积
• 网络笛卡尔积；笛卡儿积；卡氏积

英汉解释

un.

1. 笛卡尔乘积

英英解释

n.	1. a set of all the pairs of elements from two sets that have their first element from the first set and the second from the second set

例句

The lexicographical order on the Cartesian product of a set of totally ordered sets indexed by an ordinal, is itself a total order.

在用一个序数索引的那些全序集合的笛卡尔积的一个集合上的词典序自身是全序。

In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture.

第二章证明了由圈和路构成的（笛卡儿）积图满足图的边列表着色猜想。

The size of a Cartesian product result set is the number of rows in the first table multiplied by the number of rows in the second table .

第一个表的行数乘以第二个表的行数等于笛卡尔积结果集的大小。

If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.

如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。

In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.

本文研究正则图的笛卡尔乘积图与直接乘积图的限制边连通性。

If you introduce another for expression, the program will evaluate the Cartesian product.

如果引入了另一个for表达式，那么这个程序将对笛卡尔积求值。

In this paper , we study the crossing numbers of the cartesian product graph.

本文研究一类笛卡尔积图的交叉数。

The 1=1 one logic is in the expression to ensure the join will always be true and allows for the Cartesian Product result set.

表达式中的1=1逻辑确保连接一直为true并允许笛卡尔Product结果集。

It is the Cartesian product between the specified tables.

它是指定表的笛卡尔积。

A cross join that does not have a WHERE clause produces the Cartesian product of the tables involved in the join.

一个没有WHERE子句的交叉联接，会产生所关联表的笛卡尔乘积。

A cross join is also called a cross product or Cartesian product.

交叉连接也称作矢量积或笛卡儿积。

a join is a cartesian product of two row sets , with the join predicate applied as a filter to the result

一个连接是两个行集的笛卡尔乘积，谓词连接作为一个过滤结果应用。

chapter C No. English Calling sequence Call instruction Calls Call stacks Caret character ^ Cartesian product Case statement Chinese

调用序列调用指令调用调用栈迪卡尔乘积Case语句

On Adjacent Vertex-distinguishing Total-coloring of Cartesian Product Graphs of Two Paths

路的笛卡尔乘积图的邻点可区别全染色

Cartesian product and correlation of interval valued intuitionistic fuzzy sets

区间值直观模糊集的直积与相关性

The Geodetic Number of Cartesian Product on Cycles and Complete Graphs

关于圈与完全图的笛卡儿积的测地数

Isoperimetric number of a kind of Cartesian product graph

一类笛卡尔乘积图的等周数

Cartesian Product of Two Countable Sets is Countable

两个可数集合的笛卡尔乘积是可数的

Vertex-Neighbor-Integrity of the Cartesian Product of Graphs

图的笛卡尔积的邻域完整度

The comparison of product topology with box topology in Cartesian product

积拓扑与箱拓扑的比较

The Hamiltonian Cycle of Cartesian Product of Directed Cycles

有向圈卡氏积图的哈密尔顿圈

The Numbers of Spanning Trees in the Cartesian Product Graphs of Paths or Cycles

路或圈的笛卡尔乘积图的支撑树数

The 2-distance chromatic number of Cartesian product of graphs

笛卡尔积图的2-距离色数

A Popularize of Venn Diagraph in Cartesian Product

集合笛卡儿积集中文氏图的一种推广

The Crossing Numbers of Some Classes of Cartesian Product Graphic

一类笛卡积图的交叉数

Product Sets or Cartesian product

集合的笛卡儿积运算